Preconditioning techniques for the conjugate gradient solver on a parallel distributed memory computer

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver

In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...

متن کامل

Time complexity analysis for distributed memory computers Implementation of a parallel Conjugate Gradient methodI

New developments in Computer Science, both hardware and software, offer researchers, such as physicists, unprecedented possibilities to solve their computational intensive problems. However, full exploitation of e.g. new massively parallel computers, parallel languages or runtime environments requires an approach that combines elements of computer science, numerical mathematics and, in our case...

متن کامل

Nonsymmetric multigrid preconditioning for conjugate gradient methods

We numerically analyze the possibility of turning off post-smoothing (relaxation) in geometric multigrid used as a preconditioner in conjugate gradient linear and eigenvalue solvers for the 3D Laplacian. The geometric Semicoarsening Multigrid (SMG) method is provided by the hypre parallel software package. We solve linear systems using two variants (standard and flexible) of the preconditioned ...

متن کامل

A Parallel Preconditioned Bi-Conjugate Gradient Stabilized Solver for the Poisson Problem

We present a parallel Preconditioned BiConjugate Gradient Stabilized(BICGstab) solver for the Poisson problem. Given a real, nosymmetric and positive definite coefficient matrix , the parallized Preconditioned BICGstab -solver is able to find a solution for that system by exploiting the massive compute power of todays GPUs.Comparing sequential CPU implementations and that algorithm.we achieve a...

متن کامل

A Parallel Preconditioned Bi-Conjugate Gradient Stabilized Solver for the Poisson Problem

We present a parallel Preconditioned BiConjugate Gradient Stabilized(BICGstab) solver for the Poisson problem. Given a real, nosymmetric and positive definite coefficient matrix , the parallized Preconditioned BICGstab -solver is able to find a solution for that system by exploiting the massive compute power of todays GPUs.Comparing sequential CPU implementations and that algorithm.we achieve a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Magnetics

سال: 1998

ISSN: 0018-9464

DOI: 10.1109/20.717787